Accurate level energies in the EF 1 ' Y g , GK 1 ' Y g , H 1 ' Y g , B
نویسنده
چکیده
By combining results from a Doppler-free two-photon laser excitation study on several lines in the EF'g X 'g (0,0) band of H2 with results from a Fourier-transform spectroscopic study on a low-pressure discharge in hydrogen, absolute level energies, with respect to the X g , v1⁄4 0, N1⁄4 0 ground level, were determined for 547 rovibronically excited states in H2. While for some of the levels in the EF 1 g and B 1 u states the uncertainties are as low as 0.0001 cm , the accuracy of other levels is lower. The general improvement in the accuracy for the comprehensive data set of level energies is by an order of magnitude with respect to previous measurements. An updated listing of transition wavelengths of the spectral lines in the Lyman and Werner bands is presented, based on combination differences between the presently obtained B u and C 1 u level energies and those in the X g ground state.
منابع مشابه
Relative n-th non-commuting graphs of finite groups
Suppose $n$ is a fixed positive integer. We introduce the relative n-th non-commuting graph $Gamma^{n} _{H,G}$, associated to the non-abelian subgroup $H$ of group $G$. The vertex set is $Gsetminus C^n_{H,G}$ in which $C^n_{H,G} = {xin G : [x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin H}$. Moreover, ${x,y}$ is an edge if $x$ or $y$ belong to $H$ and $xy^{n}eq y^{n}x$ or $x...
متن کاملA Kind of Non-commuting Graph of Finite Groups
Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...
متن کاملبررسی آلودگی های انگلی ماهیان آکواریوم آب شیرین استان تهران
?lU: | |OI???@è?kâ?|?B? A??é? ?B??B?@??Aoü?ï@J y?pü? koAuPB? OùpA?. ?pf: ?????â| ?p? O?Bk??. c??A?BR: | |8001 ?CI? ?B?? @??Aoü???|?PIéU G? y{ â??? ?hPé?. oô}: | |K?uQ, GBè? ?B, @Gz{, ^zî, g??, kuP?Bû â?Ao}, ?Hl, ?é??, ?d??? y???, ??v? y?B ôI?çR ?p?CI? ?B?? Aq?Ep@è?kâ? A??é? Gpou? yl, GpA? Aü? ??E?oAqu?|A?lAï Aôë âvPp} ?p??J, Aqg?? âvPp} ?Bq? ôo?? @??r? @? GBâ??vB ô |Aq | uBüpA?lA?ùB G? kè...
متن کاملAmitraz Poisoning; A case study
A m i t r a z, a n i ns e c t i c i d e /a ca ri c i de of the f o r m a m i d i n e p e st i c i d e s group, is a ? 2 a d r e n e r g i c ag on i st a nd of t he a m i d i ne c h e m i ca l f a m il y generally us e d to c o n t r ol animal e c top a r a s i t e s. Poisoning due to am i t r a z i s r a r e and character...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کامل